منابع مشابه
The Firs Cerenkov Counters*
The separation of charged kaons from the more copiously produced pions adds significantly to the analyzing power of e+edetectors. Time-of-flight techniques provide this separation up to about 1 GeV/c. However, at PEP and PETRA energies a large proportion of particles have momenta above this range. A useful device to tag kaons above 1 GeVjc would be a threshold Cerenkov counter. Due to the tight...
متن کاملEvent Driven Private Counters
We define and instantiate a cryptographic scheme called “private counters”, which can be used in applications such as preferential voting to express and update preferences (or any secret) privately and non-interactively. A private counter consists of an encrypted value together with rules for updating that value if certain events occur. Updates are private: the rules do not reveal how the value...
متن کاملCapacity Choice Counters the
The Coase conjecture (1972) is the proposition that a durable goods monopolist, who sells over time and can quickly reduce prices as sales are made, will price at marginal cost. Subsequent work has shown that in some plausible cases that conjecture does not hold. We show that the Coase conjecture does not hold in any plausible case. In particular, we examine that conjecture in a model where the...
متن کاملJavaScript Hit Counters
This paper presents a summary of basic information regarding hit counters programmed in the JavaScript language and operating on ASP servers. It describes the major functions and capabilities of such hit counters, and explains how these functions can be programmed. It shows source codes, programmed in JavaScript, for a simple hit counter that can be directly utilised on ASP servers. It reveals ...
متن کاملIn-Place Binary Counters
We introduce a binary counter that supports increments and decrements in O(1) worst-case time per operation. (We assume that arithmetic operations on an index variable that is stored in one computer word can be performed in O(1) time each.) To represent any integer in the range from 0 to 2−1, our counter uses an array of at most n bits plus few words of dlg(1 +n)e bits each. Extended-regular an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2010
ISSN: 1542-7730,1542-7749
DOI: 10.1145/1810226.1810278